VULNERABILITY OF BANANA TREES VIA CLOSENESS AND RESIDUAL CLOSENESS PARAMETERS
نویسندگان
چکیده
One of the most important research topics about complex networks
 is examination their vulnerability. Therefore, there are many studies
 in literature analyzing robustness and reliability using graph theoretical parameters. Among these parameters, centrality
 parameters play an role.The closeness its derivatives
 widely discussed. In this study, parameter more sensitive
 residual which based on have
 been considered.Furthermore, banana
 tree structure have calculated.
منابع مشابه
Residual closeness in networks
A new characteristic (residual closeness) which can measure the network resistance is presented. It evaluates closeness after removal of vertices or links, hence two types are considered—vertices and links residual closeness. This characteristic is more sensitive than the well-known measures of vulnerability—it captures the result of actions even if they are small enough not to disconnect the g...
متن کاملCompetitive Closeness Testing
We test whether two sequences are generated by the same distribution or by two different ones. Unlike previous work, we make no assumptions on the distributions’ support size. Additionally, we compare our performance to that of the best possible test. We describe an efficiently-computable algorithm based on pattern maximum likelihood that is near optimal whenever the best possible error probabi...
متن کاملVagueness as Closeness
In this paper I present and defend a definition of vagueness, and draw out some consequences of accepting this definition. §1 asks what we should properly expect of a definition of vagueness, and §2 reviews existing definitions. §3 explains a key background notion necessary to an understanding of the definition to be presented here. §4 presents this definition, and §5 explains its advantages. §...
متن کاملCloseness, Prominence, and Binding Theory
The relationship between a reeexive and its antecedent is characterized by (a) a locality condition, and (b) a syntactic prominence condition. In Chomsky (1981) locality is deened in terms of governing category, and syntactic prominence is via c-command. In this article I show that, to account for the long-distance binding properties of complex reeexive ta-zijì3s-slef' in Chinese, which cast do...
متن کاملCompetitive Classification and Closeness Testing
We study the problems of classification and closeness testing. A classifier associates a test sequence with the one of two training sequences that was generated by the same distribution. A closeness test determines whether two sequences were generated by the same or by different distributions. For both problems all natural algorithms are symmetric—they make the same decision under all symbol re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Maltepe journal of mathematics
سال: 2022
ISSN: ['2667-7660']
DOI: https://doi.org/10.47087/mjm.1156370